Watershed Cuts: Minimum Spanning Forests and the Drop of Water Principle
نویسندگان
چکیده
منابع مشابه
Incremental Algorithm for Hierarchical Minimum Spanning Forests and Saliency of Watershed Cuts
We study hierarchical segmentations that are optimal in the sense of minimal spanning forests of the original image. We introduce a region-merging operation called uprooting, and we prove that optimal hierarchical segmentations are equivalent to the ones given by uprooting a watershed-cut based segmentation. Based on those theoretical results, we propose an efficient algorithm to compute such h...
متن کاملMaintaining Minimum Spanning Forests in Dynamic Graphs
We present the first fully dynamic algorithm for maintaining a minimum spanning forest in time o( √ n) per operation. To be precise, the algorithm uses O(n1/3 logn) amortized time per update operation. The algorithm is fairly simple and deterministic. An immediate consequence is the first fully dynamic deterministic algorithm for maintaining connectivity and bipartiteness in amortized time O(n1...
متن کاملSome links between extremum spanning forests, watersheds and min-cuts
Minimum cuts, extremum spanning forests and watersheds have been used as the basis for powerful image segmentation procedures. In this paper, we present some results about the links which exist between these different approaches. Especially, we show that extremum spanning forests are particular cases of watersheds from arbitrary markers and that min-cuts coincide with extremum spanning forests ...
متن کاملSome links between min-cuts, optimal spanning forests and watersheds
Di erent optimal structures: minimum cuts, minimum spanning forests and shortest-path forests, have been used as the basis for powerful image segmentation procedures. The well-known notion of watershed also falls into this category. In this paper, we present some new results about the links which exist between these di erent approaches. Especially, we show that min-cuts coincide with watersheds...
متن کاملWatershed cuts
We study the watersheds in edge-weighted graphs. Contrarily to previous works, we define the watersheds following the intuitive idea of drops of water flowing on a topographic surface. We establish the consistency (with respect to characterizations of the catchment basins and dividing lines) of these watersheds, prove their optimality (in terms of minimum spanning forests) and derive a linear-t...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Pattern Analysis and Machine Intelligence
سال: 2009
ISSN: 0162-8828
DOI: 10.1109/tpami.2008.173